Practical Proof Reconstruction for First-order Logic and Set-Theoretical Constructions
نویسندگان
چکیده
Proof reconstruction is a technique that combines an interactive theorem prover and an automatic one in a sound way, so that users benefit from the expressiveness of the first tool and the automation of the latter. We present an implementation of proof reconstruction for first-order logic and set-theoretical constructions between the interactive theorem prover Isabelle and the automatic SMT prover haRVey.
منابع مشابه
Proof reconstruction for first-order logic and set-theoretical constructions
Proof reconstruction is a technique that combines an interactive theorem prover and an automatic one in a sound way, so that users benefit of the expressiveness of the first tool and the automation of the latter. We present an implementation for proof reconstruction for first-order logic and set-theoretical constructions between Isabelle [11] and haRVey [3].
متن کاملAutomation for Dependent Type Theory
Hammers provide most powerful general purpose automation for proof assistants based on HOL and set theory today. Despite the gaining popularity of the more advanced versions of type theory, such as those based on the Calculus of Inductive Constructions, the construction of hammers for such foundations has been hindered so far by the lack of translation and reconstruction components. In this pap...
متن کاملUni cation and Anti-Uni cation in the Calculus of Constructions
We present algorithms for uniication and anti-uniication in the Calculus of Constructions, where occurrences of free variables (the variables subject to in-stantiation) are restricted to higher-order patterns, a notion investigated for the simply-typed-calculus by Miller. Most general uniiers and least common anti-instances are shown to exist and are unique up to a simple equivalence. The uniic...
متن کاملUnification and Anti-Unification in the Calculus of Constructions
We present algorithms for unification and antiunification in the Calculus of Constructions, where occurrences of free variables (the variables subject to instantiation) are restricted to higher-order patterns, a notion investigated for the simply-typed λ-calculus by Miller. Most general unifiers and least common antiinstances are shown to exist and are unique up to a simple equivalence. The uni...
متن کاملProgram Logics - for Certified Compilers
Separation logic is the twenty-first-century variant of Hoare logic that permits verification of pointer-manipulating programs. This book covers practical and theoretical aspects of separation logic at a level accessible to beginning graduate students interested in software verification. On the practical side it offers an introduction to verification in Hoare and separation logics, simple case ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006